On Cusick-Cheon's Conjecture About Balanced Boolean Functions in the Cosets of the Binary Reed-Muller Code
نویسنده
چکیده
It is proved a generalization of Cusick-Cheon’s conjecture on balanced Boolean functions in the cosets of the binary Reed-Muller code RM (k ,m) of order k and length 2m, when k = 1 or k ≥ (m − 1)/2.
منابع مشابه
On McEliece’s result about divisibility of the weights in the binary Reed-Muller codes
First, we give an alternative proof of the famous McEliece’s result about divisibility of the weights of the binary Reed-Muller codes fully relying on knowledge for Boolean functions. Second, we prove that any binary Reed-Muller code RM(r, m) contains codeword such that the highest power of 2 dividing its weight is exactly 2[(m−1)/r].
متن کاملA construction of binary linear codes from Boolean functions
Boolean functions have important applications in cryptography and coding theory. Two famous classes of binary codes derived from Boolean functions are the Reed-Muller codes and Kerdock codes. In the past two decades, a lot of progress on the study of applications of Boolean functions in coding theory has been made. Two generic constructions of binary linear codes with Boolean functions have bee...
متن کاملOn the Covering Radius of Second Order Binary Reed-Muller Code in the Set of Resilient Boolean Functions
Let Rt,n denote the set of t-resilient Boolean functions of n variables. First, we prove that the covering radius of the binary ReedMuller code RM(2, 6) in the sets Rt,6, t = 0, 1, 2 is 16. Second, we show that the covering radius of the binary Reed-Muller code RM(2, 7) in the set R3,7 is 32. We derive a new lower bound for the covering radius of the Reed-Muller code RM(2, n) in the set Rn−4,n....
متن کاملOn cryptographic properties of the cosets of R(1, m)
We introduce a new approach for the study of weight distributions of cosets of the Reed–Muller code of order 1. Our approach is based on the method introduced by Kasami in [1], using Pless identities. By interpreting some equations, we obtain a necessary condition for a coset to have a “high” minimum weight. Most notably, we are able to distinguish such cosets which have three weights only. We ...
متن کاملAsymptotically optimal Boolean functions
The largest Hamming distance between a Boolean function in $n$ variables and the set of all affine Boolean functions in $n$ variables is known as the covering radius $\rho_n$ of the $[2^n,n+1]$ Reed-Muller code. This number determines how well Boolean functions can be approximated by linear Boolean functions. We prove that \[ \lim_{n\to\infty}2^{n/2}-\rho_n/2^{n/2-1}=1, \] which resolves a conj...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Information Theory
دوره 55 شماره
صفحات -
تاریخ انتشار 2009